Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
نویسندگان
چکیده
منابع مشابه
Improved approximation algorithms for Directed Steiner Forest
We consider the k-Directed Steiner Forest (k-DSF) problem: Given a directed graph G = (V,E) with edge costs, a collection D ⊆ V × V of ordered node pairs, and an integer k ≤ |D|, find a minimum cost subgraph H of G that contains an st-path for (at least) k pairs (s, t) ∈ D. When k = |D|, we get the Directed Steiner Forest (DSF) problem. The best known approximation ratios for these problems are...
متن کاملA Primal-Dual Approximation Algorithm for the Steiner Forest Problem
Given an undirected graph with nonnegative edge-costs, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum q-Steiner forest problem is to find a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical minimum-cost Steiner tree problem on networks. We adapt a primal-dual approximation algorithm for th...
متن کاملAn Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem
In the k-median problem, given a set of locations, the goal is to select a subset of at most k centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of the k-median problem, in which each selected center can only serve a limited number of locations. Inspired by the algorithm of Charikar, Guha, Tardos and Shmoys,...
متن کاملImproved approximating algorithms for Directed Steiner Forest
We consider the k-Directed Steiner Forest (k-DSF) problem: given a directed graph G = (V,E) with edge costs, a collection D ⊆ V × V of ordered node pairs, and an integer k ≤ |D|, find a minimum cost subgraph H of G that contains an st-path for (at least) k pairs (s, t) ∈ D. When k = |D|, we get the Directed Steiner Forest (DSF) problem. The best known approximation ratios for these problems are...
متن کاملA nearly best-possible approximation algorithm for node-weighted Steiner trees
We give the rst approximation algorithm for the node-weighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless ~ P NP. Our algorithm generalizes to handle other network design problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2017
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3077581